<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    718. Maximum Length of Repeated Subarray
   </h1>
   <p>
    Given two integer arrays
    <code>
     A
    </code>
    and
    <code>
     B
    </code>
    , return the maximum length of an subarray that appears in both arrays.
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b>
A: [1,2,3,2,1]
B: [3,2,1,4,7]
<b>Output:</b> 3
<b>Explanation:</b> 
The repeated subarray with maximum length is [3, 2, 1].
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
   </p>
   <ol>
    <li>
     1 &lt;= len(A), len(B) &lt;= 1000
    </li>
    <li>
     0 &lt;= A[i], B[i] &lt; 100
    </li>
   </ol>
   <p>
    &nbsp;
   </p>
  </div>
  <div>
   <h1 class="question_title">
    718. 最长重复子数组
   </h1>
   <p>
    给两个整数数组&nbsp;
    <code>
     A
    </code>
    &nbsp;和&nbsp;
    <code>
     B
    </code>
    &nbsp;，返回两个数组中公共的、长度最长的子数组的长度。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong>
A: [1,2,3,2,1]
B: [3,2,1,4,7]
<strong>输出:</strong> 3
<strong>解释:</strong> 
长度最长的公共子数组是 [3, 2, 1]。
</pre>
   <p>
    <strong>
     说明:
    </strong>
   </p>
   <ol>
    <li>
     1 &lt;= len(A), len(B) &lt;= 1000
    </li>
    <li>
     0 &lt;= A[i], B[i] &lt; 100
    </li>
   </ol>
  </div>
 </body>
</html>